Algorithm for Crew-Scheduling Problem with Bin-Packing Features
نویسندگان
چکیده
منابع مشابه
Evolutionary Algorithm for Bin Packing Problem
In this paper we investigate the use of evolution strategy (ES) for the bin packing problem. We used (1, λ)-ES, where 10 children are generated from one parent by means of a simple genetic operators; the crossover is not applied. The best of the descendants becomes the new parent solution. A widely known ordering representation modified for the purposes of the grouping the objects was used in t...
متن کاملA Novel GRASP Algorithm for Solving the Bin Packing Problem
The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. This problem consists in packing a set of items into a minimum number of bins. There are several variants of this problem; the most basic problem is the onedimensional bin packing problem (1-BPP). In this paper, we present a new approach based on the GRASP procedure to deal with the1-BPP problem. The fir...
متن کاملParallel Coevolutionary Algorithm for Three-Dimensional Bin Packing Problem
The work considers the problem of three-dimensional bin packaging (3D-BPP), where a load of maximum volume is put in a single container. To solve the above mentioned problem there was a coevolutionary parallel algorithm used basing on the separate evolution of cooperating subpopulations of possible solutions. Computational experiments were conducted in a neighbourhood of clusters and aimed to e...
متن کاملA hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
The three-dimensional bin packing problem is a practical problem faced in modern industrial processes such as container ship loading, pallet loading, plane cargo management, and warehouse management. This article considers a three-dimensional bin packing problem in which objects of various volumes are packed into a single bin to maximize the number of objects packed. The bin packing problem ini...
متن کاملTwo Mathematical Models for Railway Crew Scheduling Problem
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Record: Journal of the Transportation Research Board
سال: 2010
ISSN: 0361-1981,2169-4052
DOI: 10.3141/2197-10